Universal Zero-Delay Joint Source-Channel Coding

نویسندگان

  • S. Matloub
  • T. Weissman
چکیده

We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. Using this scheme, we construct a universal zero-delay joint source-channel coding scheme that is guaranteed to achieve, asymptotically, the performance of the best zero-delay encoding-decoding scheme with a finite-state encoder and a Markov decoder, on all individual sequences. For the case where the channel is a DMC, we construct an implementable zero-delay joint source-channel coding scheme that is based on the “follow the perturbed leader” scheme of György et al. for lossy source coding of individual sequences. Our scheme is guaranteed to attain asymptotically the performance of the best in the set of all encoding-decoding schemes with a “symbol by symbol” decoder (and arbitrary encoder), on all individual sequences.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Competitive Zero-Delay Joint Source-Channel Coding

We consider zero-delay joint source-channel coding of individual source sequences for a general known channel. Given an arbitrary finite set of schemes with finite-memory (not necessarily time-invariant) decoders, a scheme is devised that does essentially as well as the best in the set on all individual source sequences. For the case where the channel is a DMC we construct an implementable sche...

متن کامل

Sequential decoding for lossless streaming source coding with side information

The problem of lossless fixed-rate streaming coding of discrete memoryless sources with side information at the decoder is studied. A random time-varying tree-code is used to sequentially bin strings and a Stack Algorithm with a variable bias uses the side information to give a delay-universal coding system for lossless source coding with side information. The scheme is shown to give exponentia...

متن کامل

Joint and tandem source-channel coding with complexity and delay constraints

Two common source-channel coding strategies, joint and tandem, are compared on the basis of distortion vs. complexity and distortion vs. delay by analyzing specific representatives of each when transmitting analog data samples across a binary symmetric channel. Channel-optimized transform coding is the joint source-channel strategy; transform coding plus Reed-Solomon coding is the tandem strate...

متن کامل

Zero-Delay Joint Source-Channel Coding for a Multivariate Gaussian on a Gaussian MAC

In this paper, communication of a Multivariate Gaussian over a Gaussian Multiple Access Channel is studied. Distributed zero-delay joint source-channel coding (JSCC) solutions to the problem are given. Both nonlinear and linear approaches are discussed. The performance upper bound (signalto-distortion ratio) for arbitrary code length is also derived and Zero-delay cooperative JSCC is briefly ad...

متن کامل

Zero Delay Joint Source Channel Coding for Multivariate Gaussian Sources over Orthogonal Gaussian Channels

Communication of a multivariate Gaussian source transmitted over orthogonal additive white Gaussian noise channels using delay-free joint source channel codes (JSCC) is studied in this paper. Two scenarios are considered: (1) all components of the multivariate Gaussian are transmitted by one encoder as a vector or several ideally collaborating nodes in a network; (2) the multivariate Gaussian i...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Information Theory

دوره 52  شماره 

صفحات  -

تاریخ انتشار 2006